class Solution {
public:
    int minOperations(vector<int>& nums, int x) {
		int sum=0;
		for(int a:nums)
		{
			sum+=a;
		 } 
		int target=sum-x;
		int ret=-1;
		if(target<0)
		{
			return -1;
		}
		for(int left=0,right=0,tmp=0;right<nums.size();right++)
		{
			tmp+=nums[right];
			while(target<tmp)
			{
				tmp-=nums[left++];
			}
			if(tmp==target)
			{
				ret=max(ret,right-left+1);
			}
		}
		if(ret==-1)
		{
			return ret;
		}
		else
		{
			return nums.size()-ret;
		}
    }
};
